Compromise or optimize? The breakpoint anti-median

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The complexity of the breakpoint median problem

The breakpoint median problems arise in the problem of determining phylogenetic history from comparative genome data. We prove that the breakpoint median problems, and a number of related and constrained versions, are all NP-hard.

متن کامل

Bladder cancer treatment: optimize, don't compromise.

Bladder cancer represents one of the most prevalent genitourinary cancers and one of the most challenging to manage. Comprised of two distinct entities, bladder cancer will either present as a noninvasive, relatively low-risk variant or as a muscle-invasive form that is potentially life-threatening. Treatment for noninvasive disease centers on the elimination of any residual papillary or flat d...

متن کامل

Streaming Breakpoint Graph Analytics for Accelerating and Parallelizing the Computation of DCJ Median of Three Genomes

The problem of finding the median of three genomes is the key process in building the most parsimonious phylogenetic trees from genome rearrangement data. The median problem using Double-Cut-and-Join (DCJ) distance is NP-hard and the best exact algorithm is based on a branch-and-bound best-first search strategy to explore sub-graph patterns in Multiple BreakPoint Graph (MBG). In this paper, by ...

متن کامل

Decompositions of Multiple Breakpoint Graphs and Rapid Exact Solutions to the Median Problem

The median genome problem reduces to a search for the vertex matching in the multiple breakpoint graph (MBG) that maximizes the number of alternating colour cycles formed with the matchings representing the given genomes. We describe a class of “adequate” subgraphs of MBGs that allow a decomposition of an MBG into smaller, more easily solved graphs. We enumerate all of these graphs up to a cert...

متن کامل

Algorithms for selecting breakpoint locations to optimize diversity in protein engineering by site-directed protein recombination.

Protein engineering by site-directed recombination seeks to develop proteins with new or improved function, by accumulating multiple mutations from a set of homologous parent proteins. A library of hybrid proteins is created by recombining the parent proteins at specified breakpoint locations; subsequent screening/selection identifies hybrids with desirable functional characteristics. In order ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: BMC Bioinformatics

سال: 2016

ISSN: 1471-2105

DOI: 10.1186/s12859-016-1340-y